Cardinality restrictions on concepts
نویسندگان
چکیده
منابع مشابه
Cardinality Restrictions on Concepts
ur K ¨ unstliche Intelligenz, DFKI) with sites in Kaiserslautern and Saarbrücken is a non-profit organization which was founded in 1988. The DFKI conducts application-oriented basic research in the field of artificial intelligence and other related subfields of computer science. The overall goal is to construct systems with technical knowledge and common sense which-by using AI methods-implemen...
متن کاملCardinality concepts for type-two fuzzy sets
In this paper, we de ne generalized concepts of cardinality of a fuzzy-valued function and obtained some properties of these new concepts. Also, we investigate examples for the calculation of two generalized cardinality of fuzzy-valued functions and compared with concepts of cardinality of a fuzzy set and a fuzzy-valued function. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملConcept Abduction in Description Logics with Cardinality Restrictions
Recently the usefulness of Concept Abduction, a novel non-monotonic inference service for Description Logics (DLs), has been argued in the context of ontology-based applications such as semantic matchmaking and resource retrieval. Based on tableau calculus, a method has been proposed to realize this reasoning task in ALN , a description logic that supports simple cardinality restrictions as wel...
متن کاملOn Qualified Cardinality Restrictions in Fuzzy Description Logics under Łukasiewicz semantics
Fuzzy Description Logics have been proposed as a family of languages to describe vague or imprecise structured knowledge. This work deals with one of the less studied constructors, qualified cardinality restrictions, showing some counter-intuitive behaviours under Łukasiewicz semantics, and proposing a new semantics and the corresponding reasoning algorithm.
متن کاملExtending the Description Logic ALC with More Expressive Cardinality Constraints on Concepts
We extend the terminological formalism of the well-known description logic ALC from concept inclusions (CIs) to more general constraints expressed in the quantifier-free fragment of Boolean Algebra with Presburger Arithmetic (QFBAPA). In QFBAPA one can formulate Boolean combinations of inclusion constraints and numerical constraints on the cardinalities of sets. Our new formalism extends, on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1996
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(96)00010-0